17 Face Numbers of Polytopes and Complexes
نویسندگان
چکیده
Geometric objects are often put together from simple pieces according to certain combinatorial rules. As such, they can be described as complexes with their constituent cells, which are usually polytopes and often simplices. Many constraints of a combinatorial and topological nature govern the incidence structure of cell complexes and are therefore relevant in the analysis of geometric objects. Since these incidence structures are in most cases too complicated to be well understood, it is worthwhile to focus on simpler invariants that still say something nontrivial about their combinatorial structure. The invariants to be discussed in this chapter are the f -vectors f = (f0, f1, . . .), where fi is the number of i-dimensional cells in the complex. The theory of f -vectors can be discussed at two levels: (1) the numerical relations satisfied by the fi numbers, and (2) the algebraic, combinatorial, and topological facts and constructions that give rise to and explain these relations. This chapter will summarize the main facts in the numerology of f -vectors (i.e., at level 1), with emphasis on cases of geometric interest. The chapter is organized as follows. To begin with, we treat simplicial complexes, first the general case (Section 17.1), then complexes with various Betti number constraints (Section 17.2), and finally triangulations of spheres, polytope boundaries, and manifolds (Section 17.3). Then we move on to nonsimplicial complexes, discussing first the general case (Section 17.4) and then polytopes and spheres (Section 17.5).
منابع مشابه
Signable Posets and Partitionable Simplicial Complexes
The notion of a partitionable simplicial complex is extended to that of a signable partially ordered set. It is shown in a unified way that face lattices of shellable polytopal complexes, polyhedral cone fans, and oriented matroid polytopes, are all signable. Each of these classes, which are believed to be mutually incomparable, strictly contains the class of convex polytopes. A general suffici...
متن کاملBoundary Complexes of Convex Polytopes Cannot Be Characterized Locally
It is well known that there is no local criterion to decide the linear readability of matroids or oriented matroids. We use the set-up of chirotopes or oriented matroids to derive a similar result in the context of convex polytopes. There is no local criterion to decide whether a combinatorial sphere is polytopal. The proof is based on a construction technique for rigid chirotopes. These corres...
متن کاملRemarks on Missing Faces and Generalized Lower Bounds on Face Numbers
We consider simplicial polytopes, and more general simplicial complexes, without missing faces above a fixed dimension. Sharp analogues of McMullen’s generalized lower bounds, and of Barnette’s lower bounds, are conjectured for these families of complexes. Some partial results on these conjectures are presented.
متن کاملFace Numbers of Complexes and Polytopes
Introduction. Let C be a finite polyhedral complex, i.e., a finite nonempty collection of convex polytopes in R such that (i) when P,Q E C then P flQ is a face of both and (ii) if P E C and Q is a face of P then Q EC. Let fi = fa(C) be the number of i-dimensional members of C, i > 0, called the iih face number. The discovery that the numbers fi are governed by interesting relations is due to Eu...
متن کاملInterval-Vector Polytopes
An interval vector is a (0, 1)-vector where all the ones appear consecutively. Polytopes whose vertices are among these vectors have some astonishing properties that are highlighted in this paper. We present a number of interval-vector polytopes, including one class whose volumes are the Catalan numbers and another class whose face numbers mirror Pascal’s triangle.
متن کامل